Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
نویسندگان
چکیده
منابع مشابه
A Flexible Iterative Solver for Nonconvex, Equality-Constrained Quadratic Subproblems
We present an iterative primal-dual solver for nonconvex equality-constrained quadratic optimization subproblems. The solver constructs the primal and dual trial steps from the subspace generated by the generalized Arnoldi procedure used in flexible GMRES (FGMRES). This permits the use of a wide range of preconditioners for the primal-dual system. In contrast with FGMRES, the proposed method se...
متن کاملEfficient Algorithms for Minimizing Cross Validation Error
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected to best predict future data. In some situations, such as online learning for control of robots or factories, data is cheap and human expertise costly. Cross validation can then be a highly effective method for automat...
متن کاملError minimizing algorithms for nearest neighbor classifiers
Stack Filters define a large class of discrete nonlinear filter first introduced in image and signal processing for noise removal. In recent years we have suggested their application to classification problems, and investigated their relationship to other types of discrete classifiers such as Decision Trees. In this paper we focus on a continuous domain version of Stack Filter Classifiers which...
متن کاملGeneralization Error Bounds for Noisy, Iterative Algorithms
In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data. Recent work [Xu and Raginsky (2017)] has established a bound on the generalization error of empirical risk minimization based on the mutual information I(S;W ) between the algorithm input S and the algorithm output W , when the loss f...
متن کاملSome iterative algorithms for solving regularized mixed quasi variational inequalities
In this paper, we use the auxiliary principle technique coupled with the principle of iterative regularization to suggest and analyze some new iterative algorithms for solving mixed quasi variational inequalities. We also study the convergence criteria of these algorithms under some suitable and mild conditions. Several special cases are also considered. Results obtained in this paper continue ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2019
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556788.2019.1670177